//
// Created by Symps on 2025/9/14.
//

#include "../../include/BinaryTree.h"

void test1() {
    BinaryTree<int> tree;
    tree.setRoot(1);
    const auto root = tree.getRoot();
    root->_left = BinaryTree<int>::createNode(2);
    root->_right = tree.createNode(3);
    root->_left->_left  = tree.createNode(4);

    tree.preOrder();

}

int main() {
    test1();
    return 0;
}
